The Fuzzy Description Logic G-FL0 with Greatest Fixed-Point Semantics
نویسندگان
چکیده
We study the fuzzy extension of the Description Logic FL0 with semantics based on the Gödel t-norm. We show that subsumption w.r.t. a finite set of primitive definitions, using greatest fixed-point semantics, can be characterized by a relation on weighted automata. We use this result to provide tight complexity bounds for reasoning in this logic, showing that it is PSpace-complete. If the definitions do not contain cycles, subsumption becomes co-NP-complete.
منابع مشابه
Informatik MCL Master ’ s Thesis on The Subsumption Problem of the Fuzzy Description Logic
Because of the simplicity in the structure of the Description Logic (DL) FL0, it has been commonly taken as the first example for the presentation of new notions and their associated problems [1],[2]. Fuzzy Description Logics extend classical Description Logics by allowing truth degrees to deal with imprecise concepts. In this work we show that in the fuzzy DL FL0 with greatest fixed-point sema...
متن کاملGödel FL_0 with Greatest Fixed-Point Semantics
We study the fuzzy extension of FL0 with semantics based on the Gödel t-norm. We show that gfp-subsumption w.r.t. a nite set of primitive de nitions can be characterized by a relation on weighted automata, and use this result to provide tight complexity bounds for reasoning in this logic.
متن کاملSubsumption of Concepts in FL0y for (Cyclic) Terminologies with Respect to Descriptive Semantics is PSPACE-complete
We close the gap in complexity classification of the subsumption problem in the simple description logic FL0, which allows for conjunctions and universal value restriction only. We prove that subsumption in FL0 is PSPACE-complete when cyclic definitions with descriptive semantics are allowed. Our proof uses automata theory and as a by-product the PSPACE-completeness of a certain decision proble...
متن کاملSubsumption Checking in Conjunctive Coalgebraic Fixpoint Logics
While reasoning in a logic extending a complete Boolean basis is coNP-hard, restricting to conjunctive fragments of modal languages sometimes allows for tractable reasoning even in the presence of greatest fixpoints. One such example is the EL family of description logics; here, efficient reasoning is based on satisfaction checking in suitable small models that characterize formulas in terms of...
متن کاملAugmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles
In Baader (1990a,1990b), we have considered different types of semantics for terminologicial cycles in the concept language FL0 which allows only conjunction of concepts and value restrictions. It turned out that greatest fixed-point semantics (gfp-semantics) seems to be most appropriate for cycles in this language. In the present paper we shall show that the concept defining facilities of FL0 ...
متن کامل